#define _CRT_SECURE_NO_WARNINGS 1

#include "Sort.h"

void TestBubbleSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32 };
	int n = sizeof(arr) / sizeof(arr[0]);
	BubbleSort(arr, n);
	PrintArray(arr, n);
}

void TestInsertSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32 };
	int n = sizeof(arr) / sizeof(arr[0]);
	InsertSort(arr, n);
	PrintArray(arr, n);
}

void TestShellSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32,-1,-22,-4,100,75,-113 };
	int n = sizeof(arr) / sizeof(arr[0]);
	ShellSort(arr, n);
	PrintArray(arr, n);
}

void TestHeapSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32,-1,-22,-4,100,75,-113 };
	int n = sizeof(arr) / sizeof(arr[0]);
	HeapSort(arr, n);
	PrintArray(arr, n);
}

void TestSelectSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32};
	int n = sizeof(arr) / sizeof(arr[0]);
	SelectSort(arr, n);
	PrintArray(arr, n);
}

void TestQuickSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32,-1,-22,-4,100,75,-113 };
	int n = sizeof(arr) / sizeof(arr[0]);
	QuickSort4(arr, 0, n-1);
	PrintArray(arr, n);
}

void TestMergeSort()
{
	int arr[] = { 5,2,3,1,0,8,9,6,7,4,10,22,32,-1,-22,-4,100,75,-113 };
	int n = sizeof(arr) / sizeof(arr[0]);
	MergeSort(arr, n);
	PrintArray(arr, n);
}

void TestOP()
{
	srand(time(0));
	const int N = 10000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}

	int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	QuickSort3(a1, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();

	int begin7 = clock();
	BubbleSort(a7, N);
	int end7 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("BubbleSort:%d\n", end7 - begin7);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}

void sswap(int* a, int* b)
{
	int* tmp = a;
	a = b;
	b = tmp;
}

void quickSort(int arr[], int n,int left,int right)
{
	if (left < right)
	{
		return;
	}

	int i = 0;
	int key = arr[i];
	while (left < right)
	{
		while (left<right && arr[right] > key)
		{
			right--;
		}
		while (left<right && arr[left] < key)
		{
			left++;
		}

		sswap(&arr[left], &arr[right]);
	}

	sswap(&arr[i], &arr[left]);
	i = left;

	quickSort(arr, n, 0, i);
	quickSort(arr, n, i, n - 1);
}

void Test1()
{
	int arr[] = { 31,5,7,3,-1,200,-24,3,8,0,4 };
	int n = sizeof(arr) / sizeof(arr[0]);
	quickSort(arr, n, 0, n);

	for (auto e : arr) std::cout << e << " ";
	std::cout << std::endl;
}

int main()
{
	//TestBubbleSort();
	//TestInsertSort();
	//TestShellSort();
	//TestHeapSort();
	//TestSelectSort();
	//TestQuickSort();
	//TestMergeSort();
	//TestOP();
	Test1();
	return 0;
}